Energy-Efficient Hybrid Flow-Shop Scheduling under Time-of-Use and Ladder Electricity Tariffs
نویسندگان
چکیده
With the increasing influence of climate change, green development has become an important trend. Since manufacturing represents approximately one-half total energy consumption, reducing amount consumed within this industry is imperative. This study provides a hybrid flow shop scheduling issue under time-of-use and ladder electricity price system to reduce consumption without compromising maximum completion time. An improved non-dominated sorting genetic algorithm II with some optimization strategies proposed solve problem. First, enhanced constructive heuristic used improve quantity initial solution in initialization. Besides, adaptive operation introduced, aiming avoid emergence locally optimal solutions. In addition, right-shift approach developed affecting By maintaining production efficiency cost by 4.33%. A trade-off proposal made between productivity sustainability view calculation results.
منابع مشابه
Scheduling on a single machine under time-of-use electricity tariffs
We consider the problem of scheduling jobs on a single machine to minimize the total electricity cost of processing these jobs under time-of-use electricity tariffs. For the uniform-speed case, in which all jobs have arbitrary power demands and must be processed at a single uniform speed, we prove that the non-preemptive version of this problem is inapproximable within a constant factor unless ...
متن کاملSimultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts
Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملThe Hybrid Flow Shop Scheduling with Special Time Constraints
A constraint satisfaction optimization model is established for just-in-time HFS scheduling problem with limited waiting time. Considering the problem’s complicated characteristic of having binary variables, this paper decomposes it into a Multiple Capacitated Flow Shop Scheduling (MCFS) problem and a machine allocation problem. During the process of solving the MCFS problem, a local search is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app12136456